#define  _CRT_SECURE_NO_WARNINGS
class Solution {
public:
    int rob(vector<int>& nums) {
        int n = nums.size();
        if (n == 0) return 0;
        if (n == 1) return nums[0];
        if (n == 2) return max(nums[1], nums[0]);
        vector<int> dp(n + 1);
        dp[0] = nums[0];
        dp[1] = max(nums[1], nums[0]);
        for (int i = 2; i < n; i++)
            dp[i] = max(dp[i - 1], nums[i] + dp[i - 2]);
        return max(dp[n - 1], dp[n - 2]);
    }
};